Flexible prbs architecture for a transceiver

ABSTRACT

An apparatus is provided. The apparatus comprises a polynomial register having a plurality of bits, a first bus, a second bus, and a transceiver that is coupled to the first bus, the second bus, and the polynomial register. The polynomial register is configured to store a user-defined polynomial, and the transceiver includes a pseudorandom bit sequence (PRBS) generator is configured to generate a scrambled signal from the user-defined polynomial and a PRBS checker that is configured to generate a descrambled signal from a second signal using the user-defined polynomial.

TECHNICAL FIELD

The invention relates generally to a transceiver and, more particularly,to a physical transceiver (PHY) having a flexible architecture.

BACKGROUND

Turning to FIG. 1, an example of a conventional system 100 can be seen.In this system 100, hosts 102-1 to 102-N (which can be; for example, acomputer, router, or switch) are able to communicate with one anotherover communications medium 112 (which can; for example, be an opticalfiber, backplane, or twisted pair) through network interfaces 104-1 to104-N. In this example, the network interfaces 104-1 to 104-N employEthernet over Electrical Backplanes and, more specifically, 10 GBase-KR.A description of 10 GBase-KR can be found in the Institute of Electricaland Electronics Engineers (IEEE) standard 802.3-2008 (which is datedDec. 26, 2008 and which is incorporated by reference herein for allpurposes). These network interfaces 104-1 to 104-N employ media accesscontrol (MAC) circuits 106-1 to 106-N that communicate with PHYs 110-1to 110-N via, media independent interfaces (MIIs) 108-1 to 108-N (whichcan typically have half-duplex or full-duplex operation), each of whichis described in IEEE standard 802.3-2008.

Of interest here, however, are PHYs 110-1 to 110-N, and, as can be seenin greater detail in FIG. 2, PHYs 110-1 to 110-N (hereinafter PHY 110),PHY 110 employs several sublayers. This PHY 110 can be an independentintegrated circuit (IC) or can be integrated with a MAC circuit (i.e.,MAC circuit 106-1) and an MII 108. As shown, the PHY 110 is generallycomprised of physical medium dependent (PMD) sublayer logic 212;physical medium attachment (PMA) sublayer logic 210, forward errorcorrection (FEC) sublayer logic 204, and physical coding (PCS) sublayerlogic 202. These sublayer logic circuits 202, 204, 210, and 212 interactwith one another to provide communications between MII 108 andcommunications medium 112. For transmission, the FEC sublayer logic 204employs an encoder 206 as described in IEEE standard 802.3-2008, clause74, and, for reception, the FEC sublayer logic 204 employs a decoder 308as described in IEEE standard 802.3-2008, clause 74.

As can be seen in FIG. 3, the PCS sublayer logic 202 can be atransceiver, having a PCS transmitter 302 and a PCS receiver 304. Thetransmitter 302, in this example, is able to receive data from MII 108,encode the data with encoder 306, scramble the encoded data withscrambler 308, and convert (so as to be used by FEC sublayer logic 204)with gearbox 310. The receiver 304, in this example, is able to convertdata from FEC sublayer logic 204 using gearbox 312, descramble the datawith descrambler 314, and decode the data (for use with MII 108) withdecoder 316. The details of PCS sublayer logic 202 can, for example, beseen in IEEE standard 802.3-2008, clauses 48 and 74.

Of interest here are the scrambler 308 and descrambler 314. In thisexample, the scrambler 308 and descrambler 314 are able to perform datascrambling/descrambling and error checking One purpose inscrambling/descrambling data with the PHYs 110-1 to 110-N is tosubstantially randomize the data to reduce the impact of electromagneticinterference (EMI) and improve signal integrity. This is typicallyaccomplished by the use of a pseudorandom bit sequence (PRBS) generatedwith a specified polynomial. For example, for 8b/10b encoding, a PRBS-7(or 1+x⁶+x⁷) can be employed, and, for synchronous optical networking orSONET (as specified in ITU 0.150), PRBS-23 (or X²³+X¹⁸+1). Similarly,this PRBS signaling can be employed for error checking.

However, as demonstrated above, one polynomial is generally notapplicable to all standards (e.g., 802.3-2008 and SONET); each standardusually specifies its own polynomial. Conventionally, this meant thateach PHY (e.g., 110-1) would be designed for a particular standard(e.g., PRBS-7 for 802.3-2008) and would lack the flexibility to be usedwith other standards. A reason for this is that the serial and parallelimplementations for the PHYs (e.g., 110-1) would be too costly in termsof area, price, and power consumption to be generally applicable.

Therefore, there is a need for a flexible transceiver architecture.

Some examples of conventional systems are: U.S. Pat. Nos. 4,744,104;5,267,316; 6,820,230; 6,907,062; 7,124,158; 7,414,112; 7,486,725;7,505,589; U.S. Patent Pre-Grant Publ. No. 2003/0014451; U.S. PatentPre-Grant Publ. No. 2007/008997; and U.S. Patent Pre-Grant Publ. No.2007/0098160.

SUMMARY

In accordance with an embodiment of the present invention, an apparatusis provided. The apparatus comprises a polynomial register having aplurality of bits, wherein the polynomial register is configured tostore a user-defined polynomial; a first bus; a second bus; atransceiver that is coupled to the first bus, the second bus, and thepolynomial register, wherein the transceiver includes: a pseudorandombit sequence (PRBS) generator is configured to generate a scrambledsignal from the user-defined polynomial; and a PRBS checker that isconfigured to generate a descrambled signal from a second signal usingthe user-defined polynomial.

In accordance with an embodiment of the present invention, the first busfurther comprises a first input bus and a second input bus, and whereinthe second bus further comprises a first output bus and a second outputbus, and wherein the PRBS generator is coupled of the first output bus,and wherein the PRBS checker is coupled to the second input bus.

In accordance with an embodiment of the present invention, the firstinput bus has a programmable width.

In accordance with an embodiment of the present invention, the PRBSchecker further comprises: a first matrix circuit that is configured toinclude a first matrix corresponding to the user-defined polynomial; asecond matrix circuit that is configured to include a first matrixcorresponding to the user-defined polynomial; a first multiplier that iscoupled to the second matrix circuit and that is coupled to therespective one of the encoder and the second input bus; a data registerthat is coupled to the second input bus; a second multiplier that iscoupled to the first matrix circuit and the data register; an XORcircuit that is coupled to the first and second multipliers; and anerror counter that is coupled to the XOR circuit.

In accordance with an embodiment of the present invention, the dataregister further comprises a first data register, and wherein the PRBSgenerator further comprises: a third matrix circuit that is configuredto include a third matrix corresponding to the user-defined polynomial;a third multiplier that is coupled to the third matrix circuit; a firstmultiplexer that is coupled to the third multiplier and that isconfigured to receive a seed; a second data register that is coupled tothe first multiplexer and the second data register.

In accordance with an embodiment of the present invention, thetransceiver further comprises a detector that is coupled to the PBRSgenerator and the PRBS checker.

In accordance with an embodiment of the present invention, thepolynomial register has 32 bits.

In accordance with an embodiment of the present invention, an apparatusis provided. The apparatus comprises a media access control (MAC)circuit; a interface that is coupled to the MAC circuit; a physicaltransceiver (PHY) having: a polynomial register having a plurality ofbits, wherein the polynomial register is configured to store auser-defined polynomial; a first bus that is coupled to the interface; asecond bus; a transceiver that is coupled to the first bus, the secondbus, and the polynomial register, wherein the transceiver includes: apseudorandom bit sequence (PRBS) generator is configured to generate ascrambled signal from the user-defined polynomial; and a PRBS checkerthat is configured to generate a descrambled signal from a second signalusing the user-defined polynomial.

In accordance with an embodiment of the present invention, the PHYfurther comprises a detector that is coupled to the PBRS generator andthe PRBS checker.

In accordance with an embodiment of the present invention, the apparatusfurther comprise a communications medium that is coupled to the PHY.

In accordance with an embodiment of the present invention, the detectoris configure use the PRBS generator and the PRBS checker to characterizethe communications medium.

In accordance with an embodiment of the present invention, the apparatusfurther comprises a host that is coupled to the MAC circuit.

In accordance with an embodiment of the present invention, a method isprovided. the method comprises retrieving a user-defined polynomial froma polynomial register having a plurality of bits; generating first,second, and third matrices based at least in part on the user-definedpolynomial; generating a first PRBS data set using the first matrix;transmitting the first PRBS data set over a communications medium;receiving a second PRBS data set over the communications medium; anddetermining a number of bit errors with the second PRBS data set usingthe second and third matrices.

In accordance with an embodiment of the present invention, the methodfurther comprises: adjusting the first PRBS data set; and repeating thesteps of transmitting, receiving, and determining.

In accordance with an embodiment of the present invention, the methodfurther comprises characterizing the communication channel based atleast in part on the number of bit errors.

BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of the present invention, and theadvantages thereof, reference is now made to the following descriptionstaken in conjunction with the accompanying drawings, in which:

FIG. 1 is a diagram of an example of a conventional system;

FIG. 2 is a diagram of an example of a PHY of FIG. 1;

FIG. 3 is a diagram of a PCS sublayer logic of FIG. 2;

FIGS. 4 and 5 are diagrams of an example of a PCS sublayer logic inaccordance with embodiments of the present invention;

FIG. 6 is a diagram of an example of the programmable transmission andreception circuits of FIGS. 4 and 5;

FIG. 7 is a diagram of an example of the PRBS generator of FIG. 6; and

FIG. 8 is a diagram of an example of the PRBS checker of FIG. 6.

DETAILED DESCRIPTION

Refer now to the drawings wherein depicted elements are, for the sake ofclarity, not necessarily shown to scale and wherein like or similarelements are designated by the same reference numeral through theseveral views.

Turning to FIGS. 4 and 5, example of the transceivers 400-A and 400-Bcan be seen. As shown with the example shown in FIG. 4, transceiver400-A can be used as part of PCS sublayer logic 202 of FIG. 3, and, asshown in the example of FIG. 5, transceiver 400-B can be used tocommunicate with a serializer/deserializer (SERDES) device. Otherimplementations can be used with the transceivers 400-A and 400-B,including implementations that omit encoder 306 and decoder 316. In eachcase, the transceivers 400-A and 400-B employ programmable transmissionand reception circuits 406-A/406-B and 408-A/408-B that can performscrambling/descrambling and error checking based on a user-specified oruser-defined polynomial.

Turning to FIG. 6, the programmable transmission and reception circuits406-A/406-B and 408-A/408-B (which are referred to hereinafter as 406and 408) can be seen in greater detail. Collectively, circuits 406 and408 can be considered to be a transceiver. As shown in this example,circuit 406 generally comprises a PRBS generator 504 and a scrambler502, while circuit 408 generally comprises a descrambler 506 and PRBSchecker 508. As shown, there can also be a detector 510 that is incommunication with the PRBS generator 504 and 508. This detector 512 cancause the PRBS generator 504 to transmit PRBS data sets over acommunications medium (e.g., 112) and receive the bit errors from thePRBS checker 508. Based on this information, the detector 512 can searchfor optimal settings by transmitting repeated PRBS data sets (after eachadjustment iteration) and receiving the bit errors, or it cancharacterize the communication channel (e.g., 114), allowing thedetector 512 to detect the communication medium type (e.g., twist pair,optical, and so forth). Additionally, the busses that communicate withthe scrambler 502 and descrambler 506 can have a programmable width(e.g., a maximum width of 32 bits but adjustable down to 1 bit).

Also, as can be seen in the example of FIG. 6, there is a polynomialregister 510 shown. This polynomial register 601 typically has apredetermined width or number of bits (e.g., 32 bit) that is accessibleto a user. The user is able to write to this register 601 so as to storea user-defined polynomial. As an example, if a user chooses to usePRBS-7 (which has a polynomial of 1+x⁶+x⁷) for scrambler 502, the usercan write the following to a 32-bit register (e.g., register 601):

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1

Thus, for an example register (e.g., 601) having a width of 32 bits, theuser can specify any of approximately 2×10⁹ polynomials. Thisuser-defined polynomial (which can be retrieved from register 601) canbe used by the scrambler 502, PRBS generator 504, descrambler 506, andPRBS checker 508 accordingly. Alternatively, there can be multiplepolynomial registers (e.g. 510), and each of the scrambler 502, PRBSgenerator 504, descrambler 506, and PRBS checker 508 may have a separatepolynomial register (e.g., 510).

Turning to FIGS. 7 and 8, an example of the PRBS generator 504 and PRBSchecker 506 can be seen in greater detail. Each of the example PRBSgenerator 504 and PRBS checker 506 use a user-defined polynomial thatcan be retrieved from register 510. One of the purposes in having a PRBSsystem (e.g., PRBS generator 504 and PRBS checker 506) is to allow forbit error testing of high speed serial links, and there are manycommunications standards or protocols that define or call out specificpolynomials (e.g., PRBS-7). The PRBS generator 504 and PRBS checker 506shown in this example are generally agnostic to the communicationprotocol or standard and can be used for nearly all known standards.

The PRBS system (e.g., PRBS generator 504 and PRBS checker 506) in thisexample is based in part on the generation of polynomial state and datamatrices (which can respectively be referred to as the P-matrix andD-matrix). In operation, the signal POLY (which generally corresponds tothe user-defined polynomial stored in register 510) can be used togenerate matrices, which can be referred to. The P- and D-matrices P andD are typically square binary matrices that are a function of or basedat least in part on the user-defined polynomial. The basis for formingthe P- and D-matrices P and D are identity matrices I_(P) and I_(D)(respectively), which typically have uniquely assigned vectors for eachcolumn of the first row of the P- and D-matrices P and D (i.e., P_(0,j)and D_(0,j)). An example of identity matrix I_(P) can be seen below:

$\quad\begin{bmatrix}1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1\end{bmatrix}$

The identity matrix I_(D) is generally comprised of the matrix I_(P)that is shifted or adjusted based on the desired input bus width. Forexample, the identity matrix I_(D) (which is derived from the matrixI_(P) shown above) can be as follows for a 20-bit bus width:

$\quad\begin{bmatrix}0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1\end{bmatrix}$

An adjustment vector {right arrow over (A)} is also determined.Typically, when the signal POLY1 is transmitted, the lowest bit istruncated, and a ‘0’ is appended to signal POLY1 to form adjustmentvector {right arrow over (A)}. For example, with the PRBS-7 polynomialused above, the adjustment vector A would be:

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0The P- and D-matrices P and D can then be determined.

Looking first to the P-matrix P, it can be determined on a row-by-rowbasis through the use of a set of matrices (e.g., 32-32×32 matrices),which can be referred to a working matrices WPM[r], where r denote theP-matrix P row. These working matrices WP[r], in this example, are basedat least in part on the identity matrix I_(P) and can be determinedusing the following formula:

$\begin{matrix}{\underset{\underset{\_}{\_}}{W\; {P\lbrack r\rbrack}} = \left\{ \begin{matrix}{\underset{\underset{\_}{\_}}{W\; {P\lbrack 0\rbrack}} = \underset{\underset{\_}{\_}}{I_{P}}} \\{{{W\; {P_{i,j}\lbrack r\rbrack}} = {W\; {P_{{i - 1},{j - 1}}\lbrack r\rbrack}}},{1 \leq r},{{i \leq n};{2 \leq j \leq n}}} \\{{{W\; {P_{i,0}\lbrack r\rbrack}} = {F\; N\; {P\lbrack r\rbrack}}},{1 \leq r \leq n}}\end{matrix} \right.} & (1)\end{matrix}$

where

FNP[r]=({right arrow over (WP _(j) [r−1])}⊕{right arrow over (A)})· . .. ·({right arrow over (WP ₀ [r−1])}⊕{right arrow over (A)})  (2)

The P-matrix P can then be extracted from working matrices WP[r] byapplication of the following equation:

$\begin{matrix}{P_{i,j} = \left\{ \begin{matrix}{0,{i > {B\; W}}} \\{{W\; {P_{i,j}\left\lbrack {{B\; W} - 1} \right\rbrack}},{otherwise}}\end{matrix} \right.} & (3)\end{matrix}$

where BW is the bus width. For example, with the PRBS-7 polynomial usedabove and a 20-bit bus width BW, the P-matrix P should be:

$\quad\begin{bmatrix}0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 & 0 & 0 & 0 & 0 & 1 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 1 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 1 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 1 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 1 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 1 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 & 0 & 0 & 0 & 1 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 & 0 & 0 & 0 & 1 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 & 1 & 1 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 & 1 & 1 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 & 1 & 1 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 & 1 & 1 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 & 0 & 0 & 1 & 1 & 1 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 1 & 0 & 0 & 1 & 1\end{bmatrix}$

Similarly, with D-matrix D, it can be determined on a row-by-row basisthrough the use of a set of matrices (e.g., 32-32×32 matrices) orworking matrices WD[r]. These working matrices WD[r], in this example,are based at least in part on the identity matrix I_(D) and can bedetermined using the following formula:

$\begin{matrix}{\underset{\underset{\_}{\_}}{W\; {D\lbrack r\rbrack}} = \left\{ \begin{matrix}{\underset{\underset{\_}{\_}}{W\; {D\lbrack 0\rbrack}} = \underset{\underset{\_}{\_}}{I_{D}}} \\{{{W\; {D_{i,j}\lbrack r\rbrack}} = {W\; {D_{{i - 1},{j - 1}}\lbrack r\rbrack}}},{1 \leq r},{{i \leq n};{2 \leq j \leq n}}} \\{{{W\; {D_{i,0}\lbrack r\rbrack}} = {F\; N\; {D\lbrack r\rbrack}}},{1 \leq r \leq n}}\end{matrix} \right.} & (4)\end{matrix}$

where

FND[r]=({right arrow over (WD _(j) [r−1])}⊕{right arrow over (A)})· . .. ·({right arrow over (WD ₀ [r−1])}⊕{right arrow over (A)})  (5)

The D-matrix D can then be extracted from working matrices WD[r] byapplication of the following equation:

$\begin{matrix}{D_{i,j} = \left\{ \begin{matrix}{0,{i > {B\; W}}} \\{{W\; {D_{i,j}\left\lbrack {{B\; W} - 1} \right\rbrack}},{otherwise}}\end{matrix} \right.} & (6)\end{matrix}$

Looking first to the PRBS generator 504, it does not rely on a D-matrix.As shown in FIG. 7, the matrix circuit 602 generates the P-matrix P fromsignal POLYIN as described above. Initially, when the PRBS system isactivated, the multiplexer 614 can be set to allow a seed value orvector SEED to be written to register 604. This seed value can, forexample, be a pseudorandom number generates from a clock. Once seeded,the multiplexer 614 is set to form a feedback path from the multiplier606 to registers 604. For each iteration, the multiplier 606 multipliesthe P with the value or vector stored in registers 604. The output fromthe multiplier 606 can form the output vector DATAOUT. Alternatively, aninverse of the output of multiplier 606 can be used as the output vectorDATAOUT by using the inversion circuit 610. In this case the AND gate612 (which receives a system enable signal EN and inverse enable signalINV), controls the multiplexer 608 such that it outputs the inverse ofthe output of the inversion circuit 610 as the output vector DATAOUT.

The PRBS checker 508, on the other hand, does use both the P- andD-matrices P and D and has a function that is similar to the descrambler506. In operation, the P- and D-matrices P and D are generated by matrixcircuits 702 and 704, respectively, the input data DATAIN for checker508. This input data DATAIN can also be written to register 710. Themultiplier 606 can multiply the input data DATAIN (which can for examplebe 20-bits wide data vector) by the D-matrix D. The P-matrix P can bemultiplied by the information (e.g., vector) stored in register 710 withmultiplier 712. The outputs of multipliers 706 and 712 can then be XORedwith circuit 708 and output to error counter 718 that generates an errorcount value ECNT and an error flag ERRORFLG. Alternatively, an inverseof the input data DATAIN when the multiplexer is selected to pass theoutput of inversion circuit 714; this is typically employed when thegenerator 504 is selected to output an inverted data vectors (e.g.,DATAOUT).

One advantage of having such a flexible PRBS system is that thecommunication channel can be characterized or optimized. For example, adetector 512 can be included that can control the generator 504 andchecker 506. This detector 512 can allow for iterative or repeated PRBStransmission over the communication channel, and, based on the error,adjustments can be made so as to substantially optimize transmissionover the communication channel. Alternatively, this detector 512 can beused to determine the type of communication channel (e.g., optical,twisted pair, and so forth) using similar repeated transmissions.

Having thus described the present invention by reference to certain ofits preferred embodiments, it is noted that the embodiments disclosedare illustrative rather than limiting in nature and that a wide range ofvariations, modifications, changes, and substitutions are contemplatedin the foregoing disclosure and, in some instances, some features of thepresent invention may be employed without a corresponding use of theother features. Accordingly, it is appropriate that the appended claimsbe construed broadly and in a manner consistent with the scope of theinvention.

1. An apparatus comprising: a polynomial register having a plurality ofbits, wherein the polynomial register is configured to store auser-defined polynomial; a first bus; a second bus; a transceiver thatis coupled to the first bus, the second bus, and the polynomialregister, wherein the transceiver includes: a pseudorandom bit sequence(PRBS) generator is configured to generate a scrambled signal from theuser-defined polynomial; and a PRBS checker that is configured togenerate a descrambled signal from a second signal using theuser-defined polynomial.
 2. The apparatus of claim 1, wherein the firstbus further comprises a first input bus and a second input bus, andwherein the second bus further comprises a first output bus and a secondoutput bus, and wherein the PRBS generator is coupled of the firstoutput bus, and wherein the PRBS checker is coupled to the second inputbus.
 3. The apparatus of claim 2, wherein the first input bus has aprogrammable width.
 4. The apparatus of claim 2, wherein the PRBSchecker further comprises: a first matrix circuit that is configured toinclude a first matrix corresponding to the user-defined polynomial; asecond matrix circuit that is configured to include a first matrixcorresponding to the user-defined polynomial; a first multiplier that iscoupled to the second matrix circuit and that is coupled to therespective one of the encoder and the second input bus; a data registerthat is coupled to the second input bus; a second multiplier that iscoupled to the first matrix circuit and the data register; an XORcircuit that is coupled to the first and second multipliers; and anerror counter that is coupled to the XOR circuit.
 5. The apparatus ofclaim 4, wherein the data register further comprises a first dataregister, and wherein the PRBS generator further comprises: a thirdmatrix circuit that is configured to include a third matrixcorresponding to the user-defined polynomial; a third multiplier that iscoupled to the third matrix circuit; a first multiplexer that is coupledto the third multiplier and that is configured to receive a seed; asecond data register that is coupled to the first multiplexer and thesecond data register.
 6. The apparatus of claim 5, wherein thetransceiver further comprises a detector that is coupled to the PBRSgenerator and the PRBS checker.
 7. The apparatus of claim 5, wherein thepolynomial register has 32 bits.
 8. An apparatus comprising: a mediaaccess control (MAC) circuit; a interface that is coupled to the MACcircuit; a physical transceiver (PHY) having: a polynomial registerhaving a plurality of bits, wherein the polynomial register isconfigured to store a user-defined polynomial; a first bus that iscoupled to the interface; a second bus; a transceiver that is coupled tothe first bus, the second bus, and the polynomial register, wherein thetransceiver includes: a pseudorandom bit sequence (PRBS) generator isconfigured to generate a scrambled signal from the user-definedpolynomial; and a PRBS checker that is configured to generate adescrambled signal from a second signal using the user-definedpolynomial
 9. The apparatus of claim 8, wherein the first bus has aprogrammable width.
 10. The apparatus of claim 9, wherein the PRBSchecker further comprises: a first matrix circuit that is configured toinclude a first matrix corresponding to the user-defined polynomial; asecond matrix circuit that is configured to include a first matrixcorresponding to the user-defined polynomial; a first multiplier that iscoupled to the second matrix circuit and that is coupled to therespective one of the encoder and the second input bus; a data registerthat is coupled to the second input bus; a second multiplier that iscoupled to the first matrix circuit and the data register; an XORcircuit that is coupled to the first and second multipliers; and anerror counter that is coupled to the XOR circuit.
 11. The apparatus ofclaim 10, wherein the data register further comprises a first dataregister, and wherein the PRBS generator further comprises: a thirdmatrix circuit that is configured to include a third matrixcorresponding to the user-defined polynomial; a third multiplier that iscoupled to the third matrix circuit; a first multiplexer that is coupledto the third multiplier and that is configured to receive a seed; asecond data register that is coupled to the first multiplexer and thesecond data register.
 12. The apparatus of claim 11, wherein the PHYfurther comprises a detector that is coupled to the PBRS generator andthe PRBS checker.
 13. The apparatus of claim 12, wherein the apparatusfurther comprises a communications medium that is coupled to the PHY.14. The apparatus of claim 13, wherein the detector is configured to usethe PRBS generator and the PRBS checker to characterize thecommunications medium.
 15. The apparatus of claim 14, wherein theapparatus further comprises a host that is coupled to the MAC circuit.16. The apparatus of claim 15, wherein the polynomial register has 32bits.
 17. A method comprising: retrieving a user-defined polynomial froma polynomial register having a plurality of bits; generating first,second, and third matrices based at least in part on the user-definedpolynomial; generating a first PRBS data set using the first matrix;transmitting the first PRBS data set over a communications medium;receiving a second PRBS data set over the communications medium; anddetermining a number of bit errors with the second PRBS data set usingthe second and third matrices.
 18. The method of claim 17, wherein themethod further comprises: adjusting the first PRBS data set; andrepeating the steps of transmitting, receiving, and determining.
 19. Themethod of claim 17, wherein the method further comprises characterizingthe communication channel based at least in part on the number of biterrors.